Symmetric 1-factorizations of the complete graph

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Primitive 2-factorizations of the complete graph

LetF be a 2-factorization of the complete graphKv admitting an automorphism groupG acting primitively on the set of vertices. IfF consists of Hamiltonian cycles, thenF is the unique, up to isomorphisms, 2-factorization ofKpn admitting an automorphism group which acts 2-transitively on the vertex-set, see [A. Bonisoli, M. Buratti, G. Mazzuoccolo, Doubly transitive 2-factorizations, J. Combin.Des...

متن کامل

Sequentially Perfect and Uniform One-Factorizations of the Complete Graph

In this paper, we consider a weakening of the definitions of uniform and perfect one-factorizations of the complete graph. Basically, we want to order the 2n − 1 one-factors of a one-factorization of the complete graph K2n in such a way that the union of any two (cyclically) consecutive one-factors is always isomorphic to the same two-regular graph. This property is termed sequentially uniform;...

متن کامل

On sharply vertex transitive 2-factorizations of the complete graph

We introduce the concept of a 2-starter in a groupG of odd order.We prove that any 2-factorization of the complete graph admitting G as a sharply vertex transitive automorphism group is equivalent to a suitable 2-starter in G. Some classes of 2-starters are studied, with special attention given to those leading to solutions of some Oberwolfach or Hamilton–Waterloo problems. © 2005 Elsevier Inc....

متن کامل

Symmetric Bowtie Decompositions of the Complete Graph

Given a bowtie decomposition of the complete graph Kv admitting an automorphism group G acting transitively on the vertices of the graph, we give necessary conditions involving the rank of the group and the cycle types of the permutations in G. These conditions yield non–existence results for instance when G is the dihedral group of order 2v, with v ≡ 1, 9 (mod 12), or a group acting transitive...

متن کامل

Monogamous decompositions of complete bipartite graphs, symmetric H-squares, and self-orthogonal 1-factorizations

Necessary and sufficient conditions are obtained for the existence of the structures from the title of this article.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2010

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2009.12.003